103 research outputs found
Exact performance analysis of a single-wavelength optical buffer with correlated inter-arrival times
Providing a photonic alternative to the current electronic switching in the backbone, optical packet switching (OPS) and optical bursts witching (OBS) require optical buffering. Optical buffering exploits delays in long optical fibers; an optical buffer is implemented by routing packets through a set of fiber delay lines (FDLs). Previous studies pointed out that, in comparison with electronic buffers, optical buffering suffers from an additional performance degradation. This contribution builds on this observation by studying optical buffer performance under more general traffic assumptions. Features of the optical buffer model under consideration include a Markovian arrival process, general burst sizes and a finite set of fiber delay lines of arbitrary length. Our algorithmic approach yields instant analytic results for important performance measures such as the burst loss ratio and the mean delay
Complete characterisation of the customer delay in a queueing system with batch arrivals and batch service
Whereas the buffer content of batch-service queueing systems has been studied extensively, the customer delay has only occasionally been studied. The few papers concerning the customer delay share the common feature that only the moments are calculated explicitly. In addition, none of these surveys consider models including the combination of batch arrivals and a server operating under the full-batch service policy (the server waits to initiate service until he can serve at full capacity). In this paper, we aim for a complete characterisation-i.e., moments and tail probabilities - of the customer delay in a discrete-time queueing system with batch arrivals and a batch server adopting the full-batch service policy. In addition, we demonstrate that the distribution of the number of customer arrivals in an arbitrary slot has a significant impact on the moments and the tail probabilities of the customer delay
Delay analysis of two batch-service queueing models with batch arrivals: Geo(X)/Geo(c)/1
In this paper, we compute the probability generating functions (PGF's) of the customer delay for two batch-service queueing models with batch arrivals. In the first model, the available server starts a new service whenever the system is not empty (without waiting to fill the capacity), while the server waits until he can serve at full capacity in the second model. Moments can then be obtained from these PGF's, through which we study and compare both systems. We pay special attention to the influence of the distribution of the arrival batch sizes. The main observation is that the difference between the two policies depends highly on this distribution. Another conclusion is that the results are considerably different as compared to Bernoulli (single) arrivals, which are frequently considered in the literature. This demonstrates the necessity of modeling the arrivals as batches
Distributional little's law for queues with heterogeneous server interruptions
Distributional forms of Little's law relate the steady-state distributions of the number of customers in a queueing system (system content) and the time a customer spends in the system (delay). A new law for discrete-time multiserver queues is discussed, with single-slot service times, a first-come-first-served discipline and heterogeneous server interruptions
- …